Course Generation as a Hierarchical Task Network Planning Problem

نویسنده

  • Carsten Ullrich
چکیده

Course generation automatically assembles courseware adapted to the learner’s competencies and learning goals. Previous course generators offered only a limited representation a pedagogical knowledge and did not take full advantage of service-oriented architectures. This dissertation proposes a course generation framework (called Paigos) that enables the formalization and application of complex and realistic pedagogical knowledge. Compared to previous course generation, this approach generates structured courses that are adapted to a variety of different learning goals and to the learners’ competencies. Additionally, Paigos is service-oriented, thus allowing the integration of learning-support services into generated courses in a generic and pedagogically sensible way and enabling third-party learning environments access to its functionality using a Web-service interface. Paigos was evaluated by technical, formative and summative evaluations. The technical evaluation primarily investigated the performance to Paigos; the formative and summative evaluations targeted the users’ acceptance of Paigos and of the generated courses.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Course Generation Based on HTN Planning

A course generator automatically assembles learning objects retrieved from one or several repositories to a greater unit. Different frameworks for course generation exists, but only a few allow the representation of sophisticated pedagogical knowledge. In this paper, we describe course generation based on pedagogical tasks and methods, formalized in a hierarchical task network (HTN) planner. We...

متن کامل

On the Decidability of HTN Planning with Task Insertion

The field of deterministic AI planning can roughly be divided into two approaches — classical statebased planning and hierarchical task network (HTN) planning. The plan existence problem of the former is known to be decidable while it has been proved undecidable for the latter. When extending HTN planning by allowing the unrestricted insertion of tasks and ordering constraints, one obtains a fo...

متن کامل

A Personalized Course Generation System Based on Task-centered Instruction Strategy

The Course Generation System (CGS) is a system that generates a course accommodate to the teaching material, student status and learning goal. In this paper we present a framework for authoring/course generation system using ontology and an HTN planning technique called PANDA.TUTOR. This system allows the author to prepare the course structure and content, enriched with classification informati...

متن کامل

Using Planning Graphs for Solving HTN Planning Problems

In this paper we present the GraphHTN algorithm, a hybrid planning algorithm that does Hierarchical Task-Network (HTN) planning using a combination of HTN-style problem reduction and Graphplan-style planning-graph generation. We also present experimental results comparing GraphHTN with ordinary HTN decomposition (as implemented in the UMCP planner) and ordinary Graphplan search (as implemented ...

متن کامل

Hierarchical Task Network Planning with Task Insertion and State Constraints

We extend hierarchical task network planning with task insertion (TIHTN) by introducing state constraints, called TIHTNS. We show that just as for TIHTN planning, all solutions of the TIHTNS planning problem can be obtained by acyclic decomposition and task insertion, entailing that its planexistence problem is decidable without any restriction on decomposition methods. We also prove that the e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • KI

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2008